Kato decomposition of linear pencils
نویسندگان
چکیده
منابع مشابه
Spectral Scales and Linear Pencils
Developed in 1999 by Akemann, Anderson, and Weaver, the spectral scale of an n × n matrix A, is a convex, compact subset of R that reveals important spectral information about A [4]. In this paper we present new information found in the spectral scale of a matrix. Given a matrix A = A1 + iA2 with A1 and A2 self-adjoint and A2 6= 0, we show that faces in the boundary of the spectral scale of A t...
متن کاملA QR-Decomposition for Matrix Pencils
This paper describes an eecient and numerically stable modiication of the QR decomposition for solving a parametric set of linear least squares problems with a parametric matrix A+B for several values of the parameter. The method is demonstrated on a typical application.
متن کاملThe Stability Radius of Linear Operator Pencils
Let T and S be two bounded linear operators from Banach spaces X into Y and suppose that T is Fredholm and the stability number k(T ;S) is 0. Let d(T ;S) be the supremum of all r > 0 such that dimN(T − λS) and codim R(T − λS) are constant for all λ with |λ| < r. It was proved in 1980 by H. Bart and D.C. Lay that d(T ;S) = limn→∞ γn(T ;S) , where γn(T ;S) are some non-negative (extended) real nu...
متن کاملThe Stability Radius of Fredholm Linear Pencils
Let T and S be two bounded linear operators from Banach spaces X into Y and suppose that T is Fredholm and dimN(T − λS) is constant in a neighborhood of λ = 0. Let d(T ;S) be the supremum of all r > 0 such that dimN(T − λS) and codim R(T − λS) are constant for all λ with |λ| < r. It is a consequence of more general results due to H. Bart and D.C. Lay (1980) that d(T ;S) = limn→∞ γn(T ;S) , wher...
متن کاملDescriptor fractional linear systems with regular pencils
Methods for finding solutions of the state equations of descriptor fractional discrete-time and continuous-time linear systems with regular pencils are proposed. The derivation of the solution formulas is based on the application of the Z transform, the Laplace transform and the convolution theorems. Procedures for computation of the transition matrices are proposed. The efficiency of the propo...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Studia Mathematica
سال: 2003
ISSN: 0039-3223,1730-6337
DOI: 10.4064/sm154-2-1